Termination of Rewriting With Strategy Annotations
نویسنده
چکیده
We investigate termination of rewriting computations guided by strategy annotations. We show that proofs of termination can be obtained by proving (innermost) termination of context-sensitive rewriting (CSR). Hence, we investigate how to prove innermost termination of CSR using existing methods for proving termination of CSR.
منابع مشابه
Termination of programs with strategy annotations ∗
Strategy annotations have been used in a number of programming languages and rewriting-based systems (e.g., OBJ2, OBJ3, CafeOBJ, Maude, JITty, μCRL, . . . ) for improving the termination behavior and avoiding useless computations. Regarding the ability of these annotations to improve the termination behavior of programs, the possibility of forbidding reductions on some arguments of function sym...
متن کاملSemantics of Programs with Strategy Annotations
Strategy annotations provide a simple strategy language which is used in a number of programming languages and rewriting-based systems for improving the termination behavior and avoiding useless computations. Examples are the E-strategies of Maude, OBJ2, OBJ3, and CafeOBJ, and thèjust-in-time' strategies of JITty and CRL. We show that context-sensitive rewriting strategies provide an appropriat...
متن کاملOn-demand strategy annotations revisited: An improved on-demand evaluation strategy
In functional languages such as OBJ*, CafeOBJ, and Maude, symbols are given strategy annotations that specify (the order in) which subterms are evaluated. Syntactically, strategy annotations are given either as lists of natural numbers or as lists of integers associated to function symbols whose (absolute) values refer to the arguments of the corresponding symbol. A positive index prescribes th...
متن کاملUsing Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting
Computational systems based on reducing expressions usually have a predefined reduction strategy to break down the nondeterminism which is inherent to reduction relations. The innermost strategy corresponds to call by value or eager computation, that is, the computational mechanism of several programming languages like Maude, OBJ, etc. where the arguments of a function call are always evaluated...
متن کاملOn - Demand Strategy Annotations Revisited ∗
In functional languages such as OBJ*, CafeOBJ, and Maude, symbols are given strategy annotations that specify (the order in) which subterms are evaluated. Syntactically, strategy annotations are given either as lists of natural numbers or as lists of integers associated to function symbols whose (absolute) values refer to the arguments of the corresponding symbol. A positive index prescribes th...
متن کامل